Hamiltonicity exponent of digraphs
نویسنده
چکیده
0. Initiated by Sekanina [6], in the sixties and more intensively in the seventies there were considered powers of undirected graphs with special respect to their Hamiltonian behaviour. These investigations have resulted in a lot of interesting and partly very profound propositions; we only remind of the (simple) result of Sekanina [6] that the cube of every finite connected graph is Hamiltonian connected, or of the famous theorem of Fleischner [1] that the square of any nontrivial block is Hamiltonian. For directed graphs (digraphs), the situation is completely different; till not long ago nobody was seriously engaged in studying the analogous problem for digraphs (see [4]). The main reason for this situation is that for digraphs, these questions become much more complicated than in the undirected case. This paper intends to discuss some of the difficulties arising in the case of digraphs and to present some beginning results. All digraphs are supposed to be finite.
منابع مشابه
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n ? 1), for a digraph of order n to be hamiltonian. Every (k + 1)-quasi-hamiltonian digraph is also k-quasi-hamiltonian; we construct digraphs which are k-quasi-hamiltonian, but not (k + 1)-quasi-hamiltonian. We design an algorithm that checks k-quasi-hamiltonicity of a given digraph with n vertices and m arcs in time O(nm k). We...
متن کاملOn the Meyniel condition for hamiltonicity in bipartite digraphs
We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For a ≥ 2, a strongly connected balanced bipartite digraph D on 2a vertices is hamiltonian if d(u) + d(v) ≥ 3a whenever uv / ∈ A(D) and vu / ∈ A(D). As a consequence, we obtain a sharp sufficient condition for hamiltonicity in terms of the minimal degree: a strongly connected balanced bipartite digraph D ...
متن کاملAn upper bound for the Hamiltonicity exponent of finite digraphs
Let D be a strongly k−connected digraph of order n ≥ 2. We prove that for every l ≥ n 2k the power Dl of D is Hamiltonian. Moreover, for any n > 2k ≥ 2 we exhibit strongly k-connected digraphs D of order n such that Dl−1 is non-Hamiltonian for l = d n 2ke. We use standard terminology, unless otherwise stated. A digraph D = (V, A) of order n ≥ 2 is said to be strongly q-arc Hamiltonian if for an...
متن کاملCycles in the cycle prefix digraph
Cycle prefix digraphs are a class of Cayley coset graphs with many remarkable properties such as symmetry, large number of nodes for a given degree and diameter, simple shortest path routing, Hamiltonicity, optimal connectivity, and others. In this paper we show that the cycle prefix digraphs, like the Kautz digraphs, contain cycles of all lengths l, with l between two and N , the order of the ...
متن کاملThe Spectra of Manhattan Street Networks
The multidimensional Manhattan street networks constitute a family of digraphs with many interesting properties, such as vertex symmetry (in fact they are Cayley digraphs), easy routing, Hamiltonicity, and modular structure. From the known structural properties of these digraphs, we determine their spectra, which always contain the spectra of hypercubes. In particular, in the standard (two-dime...
متن کامل